A method for detecting modules in quantitative bipartite networks
نویسندگان
چکیده
منابع مشابه
Detecting modules in quantitative bipartite networks: the QuaBiMo algorithm
Ecological networks are often composed of different sub-communities (often referred to as mod2 ules). Identifying such modules has the potential to develop a better understanding of the assem3 bly of ecological communities and to investigate functional overlap or specialisation. The most 4 informative form of networks are quantitative or weighted networks. Here we introduce an al5 gorithm to id...
متن کاملAmethod for detectingmodules in quantitative bipartite networks
1. Ecological networks are often composed of different subcommunities (often referred to asmodules). Identifying such modules has the potential to develop a better understanding of the assembly of ecological communities and to investigate functional overlap or specialization. 2. The most informative form of networks are quantitative or weighted networks. Here, we introduce an algorithm to ident...
متن کاملA evolutionary method for finding communities in bipartite networks
In a recent paper, Zhan, Zhang, Guan, and Zhou [Phys. Rev. E 83, 066120 (2011)] presented a modified adaptive genetic algorithm (MAGA) tailored to the discovery of maximum modularity partitions of the node set into communities in unipartite, bipartite, and directed networks. The authors claim that "detection of communities in unipartite networks or in directed networks can be transformed into t...
متن کاملQuantitative Function and Algorithm for Community Detection in Bipartite Networks
Community detection in complex networks is a topic of high interest in many fields. Bipartite networks are a special type of complex networks in which nodes are decomposed into two disjoint sets, and only nodes between the two sets can be connected. Bipartite networks represent diverse interaction patterns in many real-world systems, such as predator-prey networks, plant-pollinator networks, an...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methods in Ecology and Evolution
سال: 2013
ISSN: 2041-210X
DOI: 10.1111/2041-210x.12139